In chapter 2 , some necessary notations of graph theory are introduced . this chapter mainly studies covered problem of one kind of special branch factor which consists of matching set and cycles 第二章給出了圖的必要的基本概念,研究了圖的一類(lèi)特殊的由對(duì)集和圈組成的分支因子的覆蓋問(wèn)題。
It is sometimes acceptable if one branch with a score near to the optimal one is found , especially when the depth of the tree is very large and the branching factor is big , like in go , as it is often too difficult to find the optimal branch within short time 但當(dāng)找到一個(gè)分支的值接近最佳時(shí),有時(shí)是可以接受的,尤其是當(dāng)樹(shù)的深度是很大和分支因子是大的情況下,例如圍棋,因?yàn)樵诙虝r(shí)間內(nèi)往往很難找到最佳分支。